Network Interdiction through Length-Bounded Critical Disruption Paths: a Bi-Objective Approach

Solving the Bi-Objective Maximum-Flow Network-Interdiction Problem

W describe a new algorithm for computing the efficient frontier of the “bi-objective maximum-flow network-interdiction problem.” In this problem, an “interdictor” seeks to interdict (destroy) a set of arcs in a capacitated network that are Pareto-optimal with respect to two objectives, minimizing total interdiction cost and minimizing maximum flow. The algorithm identifies these solutions throu...

Network interdiction via a Critical Disruption Path: Branch-and-Price algorithms

This paper presents an innovative approach to maximally disconnect a given network. More specifically, this work introduces the concept of a critical disruption path, a path between a source and a destination vertex whose deletion minimizes the cardinality of the largest remaining connected component. Network interdiction models seek to optimally disrupt network operations. Existing interdictio...

Blind Network Interdiction Strategies - A Learning Approach

Network interdiction refers to disrupting a network in an attempt to either analyze the network’s vulnerabilities or to undermine a network’s communication capabilities. A vast majority of the works that have studied network interdiction assume a priori knowledge of the network topology. However, such knowledge may not be available in real-time settings. For instance, in practical electronic wa...

Length-bounded disjoint paths in planar graphs

Efficiently Listing Bounded Length st-Paths

The problem of listing the K shortest simple (loopless) stpaths in a graph has been studied since the early 1960s. For a nonnegatively weighted graph with n vertices and m edges, the most efficient solution is an O(K(mn+n log n)) algorithm for directed graphs by Yen and Lawler [Management Science, 1971 and 1972], and an O(K(m+ n log n)) algorithm for the undirected version by Katoh et al. [Netw...